On the maximum number of edges in hypergraphs with fixed matching and clique number

The Maximum Number of Edges in a Strongly Multiplicative Graph

On the maximum number of edges in a hypergraph with given matching number

The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max {(3s+ 2 3 ) , ( n 3 ) − ( n− s 3 )} for all n, s, n ≥ 3s+ 2.

The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges

The problem studied in this paper is that of nding the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. The main results are a lower bound and an upper bound, both given by closedform formulas, for the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. c © 2000 Elsevier Science B.V. All rights reserved.

Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded

We determine the maximum number of edges that a claw-free graph can have, when its maximum degree and matching number are bounded. This is a famous problem that has been studied on general graphs, and for which there is a tight bound. The graphs achieving this bound contain in most cases an induced copy of K1,3, the claw, which motivates studying the question on claw-free graphs. Note that on g...

the maximum number of edges in a strongly multiplicative graph

0